Track assignment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Track Assignment 1

We consider a station in which several trains might stop at the same track at the same time. The trains might enter and leave the station from both sides, but the arrival and departure times and directions are fixed according to a given time table. The problem is to assign tracks to the trains such that they can enter and leave the station on time without being blocked by any other train. We co...

متن کامل

Rstricted Track Assignment with Applications

Consider a set of intervals S fI I Ing where Ii li ri li and ri are real numbers and li ri We study a restricted track assignment problem RTAP if an interval Ia contains another interval Ib then Ia must be assigned to a higher track than Ib and the goal is to minimize the number of tracks used The problem RTAP is shown to be NP hard An approximation algorithm that produces a solution within twi...

متن کامل

Restricted Track Assignment with Applications

Consider a set of intervals S = fI 1 ; I 2 numbers, and l i < r i. We study a restricted track assignment problem (RTAP): if an interval Ia contains another interval I b then Ia must be assigned to a higher track than I b , and the goal is to minimize the number of tracks used. The problem RTAP is shown to be NP-hard. An approximation algorithm that produces a solution within twice of the optim...

متن کامل

A New Parameterless Credal Method to Track-to-Track Assignment Problem

This paper deals with the association step in a multi-sensor multitarget tracking process. A new parameterless credal method for track-to-track assignment is proposed and compared with parameter-dependent methods, namely: the well known Global Nearest Neighbor algorithm (GNN) and a credal method recently proposed by Denœux et al.

متن کامل

Credit Assignment in Adaptive Evolutionary Algorithms Track: Genetic Algorithms

In this paper, a new method for assigning credit to search operators is presented. Starting with the principle of optimizing search bias, search operators are selected based on an ability to create solutions that are historically linked to future generations. Using a novel framework for defining performance measurements, distributing credit for performance, and the statistical interpretation of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Discrete Algorithms

سال: 2007

ISSN: 1570-8667

DOI: 10.1016/j.jda.2006.05.001